Graph bisection algorithms
نویسنده
چکیده
In this thesis, we describe a polynomial time algorithm that, for every input graph, either outputs the minimum bisection of the graph or halts without output. More importantly, we show that the algorithm chooses the former course with high probability for many natural classes of graphs. In particular, for every fixed d > 3, all sufficiently large n and all b = o(ni-1/d2lJ), the algorithm finds the minimum bisection for almost all d-regular labelled simple graphs with 2n nodes and bisection width b. For example, the algorithm succeeds for almost all 5-regular graphs with 2n nodes and bisection width o(n2/3). The algorithm differs from other graph bisection heuristics (as well as from many heuristics for other NP-complete problems) in several respects. Most notably: (i) the algorithm provides exactly the minimum bisection for almost all input graphs with the specified form, instead of only an approximation of the minimum bisection, (ii) whenever the algorithm produces a bisection, it is guaranteed to be optimal (i.e., the algorithm also produces a proof that the bisection it outputs is an optimal bisection), (iii) the algorithm works well both theoretically and experimentally, (iv) the algorithm employs global methods such as network flow instead of local operations such as 2-changes, and (v) the algorithm works well for graphs with small bisections (as opposed to graphs with large bisections, for which arbitrary bisections are nearly optimal). We also show that with high probability the greedy algorithm will not be able to find the optimal bisection for almost every random regular graph with given bisection width. In the last part of the thesis we describe a new algorithm which is found to perform well in practice, but we have no analysis for it. Finally, we describe a heuristic that when combined with other well-known algorithms such as Kernighan-Lin seems to improve the performance of these algorithms for small degree graphs. Thesis Supervisor : F. Thomson Leighton Title : Associate Professor of Applied Mathematics
منابع مشابه
An Implementation of State-of-the-Art Graph Bisection Algorithms
In recent decades, various graph partitioning heuristic algorithms have been developed by researchers, which are widely used in “realworld” applications. As a starting point of graph partition problem, graph bisection algorithms provide basic approaches and solutions for other graph partition instances. This work implemented part of contemporary graph bisection algorithms which produce high-qua...
متن کاملGraph Bisection Optimization: A Comparison Between GA, ILS and FF Metaheuristics
The aim of this paper is to compare different metaheuristics for the graph bisection problem. For this purpose, the Bui and Moon’s genetic algorithm adaptation for graph bisection is used. A second genetic algorithm adaptation for graph bisection is also presented. These algorithms are compared to an implementation of the iterated local search metaheuristic for graph bisection. All these metahe...
متن کاملMultilevel Optimization of Graph Bisection with Pheromones
We present a multiple ant-colony algorithm (MACA) for the graph bisection problem. The aim of this paper is to compare the performance of the MACA with results on the benchmark graphs from Graph partitioning Archive at the University of Greenwich. Experimental results show that the MACA is comparable with the state-of-the-art graph bisection algorithms.
متن کاملVertex Bisection is Hard, too
We settle an open problem mentioned in Diaz, Petit, and Serna: A survey of graph layout problems (ACM Computing Surveys 34:313–356, 2002). Of eight objectives considered in that survey, only the complexity status of minimum vertex bisection is listed as unknown. We show that both minimum and maximum vertex bisection are NP-hard, but polynomially solvable on special graph classes such as hypercu...
متن کاملThe Bisection of Random Graphs: Rigorous Bounds Using the Analysis of Algorithms
Given a random graph G = G n;1=2 , we give almost sure bounds for the value of the minimum bisection of G. The lower bound is obtained by applying the rst moment method, while the upper bound is given by the analysis of a simple algorithm. Moreover, these results enable us to derive upper bounds for the maximum bisection and the maxcut of G.
متن کاملFinding Almost-Perfect Graph Bisections
We give a polynomial time algorithm that given a graph which admits a bisection cutting a fraction (1 − ε) of edges, finds a bisection cutting a (1 − g(ε)) fraction of edges where g(ε) → 0 as ε→ 0. One can take g(ε) = O( 3 √ ε log(1/ε)). Previously known algorithms for Max Bisection could only guarantee finding a bisection that cuts a fraction of edges bounded away from 1 (in fact less than 3/4...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986